The General Totally Positive Matrix Completion Problem with Few Unspecified Entries
نویسندگان
چکیده
For m by n partial totally positive matrices with exactly one unspeci ed entry the set of positions for that entry that guarantee completability to a totally positive matrix are characterized They are the positions i j i j and the positions i j i j m n In each case the set of completing entries is an open and in nite in case i j or i m j n interval In the process some new structural results about totally positive matrices are developed In addition the pairs of positions that guarantee completability in partial totally positive matrices with two unspeci ed entries are characterized in low dimensions
منابع مشابه
Graph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملThe N 10 - Matrix Completion Problem
An n×n matrix is called an N1 0 -matrix if all its principal minors are non-positive and each entry is non-positive. In this paper, we study general combinatorially symmetric partial N1 0 -matrix completion problems and prove that a combinatorially symmetric partial N1 0 -matrix with all specified offdiagonal entries negative has an N1 0 -matrix completion if the graph of its specified entries ...
متن کاملEla Conditions for a Totally Positive Completion in the Case of a Symmetrically Placed Cycle
Abstract. In earlier work, the labelled graphs G for which every combinatorially symmetric totally nonnegative matrix, the graph of whose specified entries is G, has a totally nonnegative completion were identified. For other graphs, additional conditions on the specified data must hold. Here, necessary and sufficient conditions on the specified data, when G is a cycle, are given for both the t...
متن کاملGradient Flow Methods for Matrix Completion with Prescribed Eigenvalues
Abstract. Matrix completion with prescribed eigenvalues is a special type of inverse eigenvalue problems. The goal is to construct a matrix subject to the structural constraint of prescribed entries and the spectral constraint of prescribed spectrum. The challenge of such a completion problem lies in the intertwining of the cardinality and the location of the prescribed entries so that the inve...
متن کاملof Linear Algebra . A publication of the International Linear
An n-by-n real matrix is called a P -matrix if all its principal minors are positive. The P -matrix completion problem asks which partial P -matrices have a completion to a P -matrix. Here, we prove that every partial P -matrix with combinatorially symmetric speci ed entries has a P -matrix completion. The general case, in which the combinatorial symmetry assumption is relaxed, is also discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012